/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: MENG
 * Date: 2022-08-12
 * Time: 18:47
 */
public class HashBuck2<K,V> {
    static class Node<K, V> {
        public K key;
        public V val;
        public Node<K, V> next;

        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }
    //构造数组空间
    public Node<K,V>[] array = (Node<K, V>[]) new Node[10];
    public int usedSize;
    public static final float DEFAULT_LOAD_FACTOR = 0.75F;

    public void put(K key,V val){
        Node<K, V> node = new Node<>(key,val);
        int hash = node.hashCode();
        int index = hash % array.length;

        Node<K, V> cur = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                cur.val = val;
            }
            cur = cur.next;
        }

        node.next = array[index];
        array[index] = node;
        this.usedSize++;

    }
    public V get(K key){
        int hash = key.hashCode();
        int index = hash % array.length;

        Node<K, V> cur = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                return cur.val;
            }
            cur = cur.next;
        }
        return null;
    }
}